Double covers of graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Suborthogonal double covers of complete graphs

A family G of isomorphic copies of a given graph G is said to be a suborthogonal double cover (SODC) of the complete graph K n by G, if every edge of K n belongs to exactly two members of G and any two diierent elements from G share at most one edge. We introduce the notion of an SODC as a generalization of the well-known concept of orthogonal double covers. Our objective is to investigate the ...

متن کامل

Orthogonal double covers of complete bipartite graphs

Let H = {A1, . . . , An, B1, . . . , Bn} be a collection of 2n subgraphs of the complete bipartite graph Kn,n. The collection H is called an orthogonal double cover (ODC) of Kn,n if each edge of Kn,n occurs in exactly two of the graphs in H; E(Ai) ∩ E(Aj) = φ = E(Bi) ∩ E(Bj) for every i, j ∈ {1, . . . , n} with i = j, and for any i, j ∈ {1, . . . , n}, |E(Ai)∩E(Bj)| = 1. If Ai ∼= G ∼= Bi for al...

متن کامل

6-cycle Double Covers of Cubic Graphs

A cycle double cover (CDC) of an undirected graph is a collection of the graph’s cycles such that every edge of the graph belongs to exactly two cycles. We describe a constructive method for generating all the cubic graphs that have a 6-CDC (a CDC in which every cycle has length 6). As an application of the method, we prove that all such graphs have a Hamiltonian cycle. A sense of direction is ...

متن کامل

Construction of Cycle Double Covers for certain classes of graphs

We introduce two classes of graphs, Indonesian graphs and k-doughnut graphs. Cycle double covers are constructed for these classes. In case of doughnut graphs this is done for the values k = 1, 2, 3 and 4.

متن کامل

Directed cycle double covers: structure and generation of hexagon graphs

Jaeger’s directed cycle double cover conjecture can be formulated as a problem of existence of special perfect matchings in a class of graphs that we call hexagon graphs. In this work, we explore the structure of hexagon graphs. We show that hexagon graphs are braces that can be generated from the ladder on 8 vertices using two types of McCuaig’s augmentations.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Australian Mathematical Society

سال: 1976

ISSN: 0004-9727,1755-1633

DOI: 10.1017/s0004972700025053